Nash Implementation Using Undominated Strategies
نویسنده
چکیده
We study the problem of implementing social choice correspondences using the concept of undominated Nash equilibrium, i.e. Nash equilibrium in which no one uses a weakly dominated strategy. We show that this mild refinement of Nash equilibrium has a dramatic impact on the set of implementable correspondences. Our main result is that if there are at least three agents in the society, then any correspondence which satisfies the usual no veto power condition is implementable unless some agents are completely indifferent over all possible outcomes. Many common welfare criteria, such as the Pareto correspondence, and several familiar voting rules, such as majority and plurality rules, satisfy our conditions. This possibility result stands in sharp contrast to the more restrictive findings with implementation in either Nash equilibrium or subgame perfect equilibrium. We present several examples to illustrate the difference between undominated Nash implementation and implementation with alternative solution concepts.
منابع مشابه
Some Limitations of Virtual Bayesian Implementation
Ž Ž .. AS IS WELL KNOWN, Maskin monotonicity Maskin 1977 is a necessary condition for a social choice correspondence to be Nash implementable. In economic environments with at least three agents and a private good, this condition is also sufficient for Nash Ž . Ž . implementation. Remarkably, Abreu and Sen 1991 and Matsushima 1988 showed that this condition can be entirely dispensed with if the...
متن کاملAxiomatic Theory of Equilibrium Selection in Signaling Games with Generic Payoffs
Three axioms from decision theory select sets of Nash equilibria of signaling games in extensive form with generic payoffs. The axioms require undominated strategies (admissibility), inclusion of a sequential equilibrium (backward induction), and dependence only on the game’s normal form even when embedded in a larger game with redundant strategies or irrelevant players (small worlds). The axio...
متن کاملA Complexity Result for Undominated-Strategy Implementation
We prove that there exist social choice correspondences that can be implemented in undominated strategies, using finite mechanisms, but can require arbitrarily many strategies to do so, even when there are only two agents and two types of each agent. This is in sharp contrast with dominant-strategy implementation, where the revelation principle implies that only one strategy for each type of ag...
متن کاملImplementation with Near - Complete Information ∗
Many refinements of Nash equilibrium yield solution correspondences which do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a desired outcome, and entertains the possibility that players may have even the slightest uncertaint...
متن کاملImplementation in undominated strategies by bounded mechanisms: The Pareto Correspondence
We show that the Pareto correspondence can be implemented in weakly undominated strategies by bounded mechanisms provided there are at least three agents.
متن کامل